PSI: Exact Symbolic Inference for Probabilistic Programs
نویسندگان
چکیده
Probabilistic inference is a key mechanism for reasoning about probabilistic programs. Since exact inference is theoretically expensive, most probabilistic inference systems today have adopted approximate inference techniques, which trade precision for better performance (but often without guarantees). As a result, while desirable for its ultimate precision, the practical effectiveness of exact inference for probabilistic programs is mostly unknown. This paper presents PSI (http://www.psisolver.org), a novel symbolic analysis system for exact inference in probabilistic programs with both continuous and discrete random variables. PSI computes succinct symbolic representations of the joint posterior distribution represented by a given probabilistic program. PSI can compute answers to various posterior distribution, expectation and assertion queries using its own backend for symbolic reasoning. Our evaluation shows that PSI is more effective than existing exact inference approaches: (i) it successfully computed a precise result for more programs, and (ii) simplified expressions that existing computer algebra systems (e.g., Mathematica, Maple) fail to handle.
منابع مشابه
Probabilistic inference as an exercise in symbolic reasoning (Submitted to Calculemus 2006)
According to the interpretation of probability sometimes called the logical Bayesian interpretation, probability is the appropriate method for reasoning under uncertainty, in the sense that it is essentially the only generalization of logic to degrees of belief other than 0 and 1, given certain desiderata. However, the broad application of probability to many practical inference problems is ham...
متن کاملProbability, programs, and the mind: Building structured Bayesian models of cognition
Human thought is remarkably flexible: we can think about infinitely many different situations despite uncertainty and novelty. Probabilistic models of cognition (Chater, Tenenbaum, & Yuille, 2006) have been successful at explaining a wide variety of learning and reasoning under uncertainty. They have borrowed tools from statistics and machine learning to explain phenomena from perception (Yuill...
متن کاملSymbolic Variable Elimination for Discrete and Continuous Graphical Models
Probabilistic reasoning in the real-world often requires inference in continuous variable graphical models, yet there are few methods for exact, closed-form inference when joint distributions are non-Gaussian. To address this inferential deficit, we introduce SVE – a symbolic extension of the well-known variable elimination algorithm to perform exact inference in an expressive class of mixed di...
متن کاملComposing Inference Algorithms as Program Transformations
Probabilistic inference procedures are usually coded painstakingly from scratch, for each target model and each inference algorithm. We reduce this effort by generating inference procedures from models automatically. We make this code generation modular by decomposing inference algorithms into reusable program-toprogram transformations. These transformations perform exact inference as well as g...
متن کاملInference in probabilistic logic programs with continuous random variables
Probabilistic Logic Programming (PLP), exemplified by Sato and Kameya’s PRISM, Poole’s ICL, Raedt et al’s ProbLog and Vennekens et al’s LPAD, is aimed at combining statistical and logical knowledge representation and inference. However, the inference techniques used in these works rely on enumerating sets of explanations for a query answer. Consequently, these languages permit very limited use ...
متن کامل